Using MILP Tools to Study R&D Portfolio Selection Model for Large Instances in Public and Social Sector

In this paper a mixed-integer linear programming (MILP) model is studied for the bi-objective public R&D projects portfolio problem. The proposed approach provides an acceptable compromise between the impact and the number of supported projects. Lagrangian relaxation techniques are considered to get easy computable bounds for the objectives. The experiments show that a solution can be obtained in less than a minute for instances comprising of up to 25,000 project proposals. This brings significant improvement to the previous approaches that efficiently manage instances of a few hundred projects.